Natural Selection and Mating Constraints With Genetic Algorithms
نویسندگان
چکیده
منابع مشابه
Genetic Algorithms: Artificial Selection vs Natural Selection
Genetic Algorithms (GAs) are a stochastic searching and optimizing method inspired by the biological mechanism of natural selection and evolution. To improve the searching power of GAs for complicated problems, many deterministic measures, particularly, experience and/or expert knowledge-based heuristic rules, have been studied in the existing literature. This paper proposes a potentially more ...
متن کاملSimulating Gender Separation and Mating Constraints for Genetic Algorithms
This report presents a model for simulating various reproduction modes and types restrictions from nature with the genetic algorithms. We consider three reproduction modes, which are self-fertilizing, hermaphrodite excluding self fertilization, and with two differentiated gender types (male and female). We start with a model in which the reproduction mode evolves along with the rest of the geno...
متن کاملGenetic Algorithms and General Constraints
Genetic algorithms, while robust solution space searching methods, do not perform well when faced with general constraints. In some applications, for example the Traveling Sales-person Problem, problem-speciic operators and codings can be developed. However, general constraints are still problematic. Described here are general methods to nd an optimal or near-optimal solution to a problem while...
متن کاملA Novel Mating Approach for Genetic Algorithms
Genetic algorithms typically use crossover, which relies on mating a set of selected parents. As part of crossover, random mating is often carried out. A novel approach to parent mating is presented in this work. Our novel approach can be applied in combination with a traditional similarity-based criterion to measure distance between individuals or with a fitness-based criterion. We introduce a...
متن کاملDiversity Adaptation in Genetic Algorithms with Preference Mating
The diversity of the population affects the convergence rate in genetic algorithms. The determination of the proper diversity is still a trial and error process. The objective of this work is to study a method to adapt suitable population diversity for a given problem. The proposed method is based on a modified restricted mating called “preference mating”. Three well-known test problems, which ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Modelling and Simulation
سال: 2008
ISSN: 0228-6203,1925-7082
DOI: 10.1080/02286203.2008.11442467